Ingrese una palabra o frase en cualquier idioma 👆
Idioma:
Traducción y análisis de palabras por inteligencia artificial ChatGPT
En esta página puede obtener un análisis detallado de una palabra o frase, producido utilizando la mejor tecnología de inteligencia artificial hasta la fecha:
- cómo se usa la palabra
- frecuencia de uso
- se utiliza con más frecuencia en el habla oral o escrita
- opciones de traducción
- ejemplos de uso (varias frases con traducción)
- etimología
Qué (quién) es locally isomorphic - definición
Computably isomorphic
Locally convex topological vector space
TYPE OF TOPOLOGICAL VECTOR SPACE
Locally convex; Locally convex space; Locally convex spaces; Locally convex topology; Locally convex basis; Locally convex vector space; LCTVS; Finest locally convex topology
In functional analysis and related areas of mathematics, locally convex topological vector spaces (LCTVS) or locally convex spaces are examples of topological vector spaces (TVS) that generalize normed spaces. They can be defined as topological vector spaces whose topology is generated by translations of balanced, absorbent, convex sets.
Semi-locally simply connected
![The [[Hawaiian earring]] is not semi-locally simply connected.](https://commons.wikimedia.org/wiki/Special:FilePath/Hawaiian earrings.svg?width=200 "The [[Hawaiian earring]] is not semi-locally simply connected.")
In mathematics, specifically algebraic topology, semi-locally simply connected is a certain local connectedness condition that arises in the theory of covering spaces. Roughly speaking, a topological space X is semi-locally simply connected if there is a lower bound on the sizes of the “holes” in X.
Locally nilpotent
In the mathematical field of commutative algebra, an ideal I in a commutative ring A is locally nilpotent at a prime ideal p if Ip, the localization of I at p, is a nilpotent ideal in Ap.
Wikipedia
Computable isomorphism
In computability theory two sets of natural numbers are computably isomorphic or recursively isomorphic if there exists a total bijective computable function with . By the Myhill isomorphism theorem, the relation of computable isomorphism coincides with the relation of mutual one-one reducibility.
Two numberings and are called computably isomorphic if there exists a computable bijection so that
Computably isomorphic numberings induce the same notion of computability on a set.
